On the Joint Source-Channel Coding Excess Distortion Exponent for Memoryless Continuous-Alphabet Systems

نویسندگان

  • Y. Zhong
  • F. Alajaji
  • Yangfan Zhong
  • Fady Alajaji
  • L. Lorne Campbell
چکیده

We investigate the joint source-channel coding (JSCC) excess distortion exponent EJ (the exponent of the probability of exceeding a prescribed distortion level) for memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for EJ for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryless additive Gaussian noise channel with a quadratic power constraint at the channel input. A necessary and sufficient condition for which the two bounds coincide is provided, thus exactly determining the exponent. This condition is observed to hold for a wide range of source-channel parameters. The problem of transmitting memoryless Laplacian sources over the Gaussian channel under the magnitudeerror distortion is also carried out. We also establish a lower bound for EJ for a certain class of continuous source-channel pairs when the distortion measure is a metric. The advantage in terms of the excess distortion exponent of JSCC over traditional tandem coding for Gaussian systems is next studied. A formula for the tandem exponent is derived in terms of the Gaussian source and Gaussian channel exponents. By numerically comparing the lower bound of the joint exponent and the upper bound of the tandem exponent, it is observed that, as for the discrete systems, JSCC often substantially outperforms tandem coding.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint Source–Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems

We investigate the joint source–channel coding (JSCC) excess distortion exponent (the exponent of the probability of exceeding a prescribed distortion level) for some memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryles...

متن کامل

On the Joint Source-Channel Coding Error Exponent for Discrete Memoryless Systems: Computation and Comparison with Separate Coding

We investigate the computation of Csiszár’s bounds for the joint source-channel coding (JSCC) error exponent, EJ , of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent representations can be readily compu...

متن کامل

Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding

Lossy compression of a discrete memoryless source (DMS) with respect to a single-letter distortion measure is considered. We study the best attainable tradeoff between the exponential rates of the probabilities that the codeword length and that the cumulative distortion exceed respective thresholds for two main cases. The first scenario examined is that where the source is corrupted by a discre...

متن کامل

Error Exponent for Coding of Memoryless Gaussian Sources with a Fidelity Criterion

We are interesting in the error exponent for source coding with fidelity criterion. For each fixed distortion level ∆, the maximum attainable error exponent at rate R, as a function of R, is called the reliability function. The minimum rate achieving the given error exponent is called the minimum achievable rate. For memoryless sources with finite alphabet, Marton (1974) gave an expression of t...

متن کامل

Analogy and duality between random channel coding and lossy source coding

Here we write in a unified fashion (using “R(P,Q,D)” [1]) the random coding exponents in channel coding and lossy source coding. We derive their explicit forms and show, that, for a given random codebook distribution Q, the channel decoding error exponent can be viewed as an encoding success exponent in lossy source coding, and the channel correct-decoding exponent can be viewed as an encoding ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008